TSTP Solution File: CSR119^1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : CSR119^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n022.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 30 21:06:57 EDT 2023
% Result : Theorem 0.20s 0.52s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR119^1 : TPTP v8.1.2. Released v4.1.0.
% 0.14/0.14 % Command : do_cvc5 %s %d
% 0.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Aug 28 12:08:54 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.48 %----Proving TH0
% 0.20/0.49 %------------------------------------------------------------------------------
% 0.20/0.49 % File : CSR119^1 : TPTP v8.1.2. Released v4.1.0.
% 0.20/0.49 % Domain : Commonsense Reasoning
% 0.20/0.49 % Problem : Did someone like Bill in 2009?
% 0.20/0.49 % Version : Especial > Reduced > Especial.
% 0.20/0.49 % English : During 2009 Mary liked Bill and Sue liked Bill. Is it the case
% 0.20/0.49 % that someone liked Bill during 2009?
% 0.20/0.49
% 0.20/0.49 % Refs : [PS07] Pease & Sutcliffe (2007), First Order Reasoning on a L
% 0.20/0.49 % : [BP10] Benzmueller & Pease (2010), Progress in Automating Hig
% 0.20/0.49 % : [Ben10] Benzmueller (2010), Email to Geoff Sutcliffe
% 0.20/0.49 % Source : [Ben10]
% 0.20/0.49 % Names : ef_1.tq_SUMO_local [Ben10]
% 0.20/0.49
% 0.20/0.49 % Status : Theorem
% 0.20/0.49 % Rating : 0.09 v8.1.0, 0.08 v7.4.0, 0.11 v7.3.0, 0.10 v7.2.0, 0.12 v7.1.0, 0.14 v7.0.0, 0.12 v6.4.0, 0.14 v6.3.0, 0.17 v6.2.0, 0.00 v6.1.0, 0.50 v6.0.0, 0.17 v5.5.0, 0.20 v5.4.0, 0.25 v5.3.0, 0.50 v4.1.0
% 0.20/0.49 % Syntax : Number of formulae : 10 ( 0 unt; 8 typ; 0 def)
% 0.20/0.49 % Number of atoms : 5 ( 0 equ; 0 cnn)
% 0.20/0.49 % Maximal formula atoms : 3 ( 2 avg)
% 0.20/0.49 % Number of connectives : 13 ( 0 ~; 0 |; 1 &; 12 @)
% 0.20/0.49 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.20/0.49 % Maximal formula depth : 5 ( 5 avg)
% 0.20/0.49 % Number of types : 3 ( 1 usr)
% 0.20/0.49 % Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% 0.20/0.49 % Number of symbols : 7 ( 7 usr; 4 con; 0-2 aty)
% 0.20/0.49 % Number of variables : 1 ( 0 ^; 0 !; 1 ?; 1 :)
% 0.20/0.49 % SPC : TH0_THM_NEQ_NAR
% 0.20/0.49
% 0.20/0.49 % Comments : This is a simple test problem for reasoning in/about SUMO.
% 0.20/0.49 % Initally the problem has been hand generated in KIF syntax in
% 0.20/0.49 % SigmaKEE and then automatically translated by Benzmueller's
% 0.20/0.49 % KIF2TH0 translator into THF syntax.
% 0.20/0.49 % : The translation has been applied in two modes: local and SInE.
% 0.20/0.49 % The local mode only translates the local assumptions and the
% 0.20/0.49 % query. The SInE mode additionally translates the SInE-extract
% 0.20/0.49 % of the loaded knowledge base (usually SUMO).
% 0.20/0.49 % : The examples are selected to illustrate the benefits of
% 0.20/0.49 % higher-order reasoning in ontology reasoning.
% 0.20/0.49 % : This example is similar to the one discussed in [PS07]
% 0.20/0.49 %------------------------------------------------------------------------------
% 0.20/0.49 %----The extracted signature
% 0.20/0.49 thf(numbers,type,
% 0.20/0.49 num: $tType ).
% 0.20/0.49
% 0.20/0.49 thf(holdsDuring_THFTYPE_IiooI,type,
% 0.20/0.49 holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
% 0.20/0.49
% 0.20/0.49 thf(lBill_THFTYPE_i,type,
% 0.20/0.49 lBill_THFTYPE_i: $i ).
% 0.20/0.49
% 0.20/0.49 thf(lMary_THFTYPE_i,type,
% 0.20/0.49 lMary_THFTYPE_i: $i ).
% 0.20/0.49
% 0.20/0.49 thf(lSue_THFTYPE_i,type,
% 0.20/0.49 lSue_THFTYPE_i: $i ).
% 0.20/0.49
% 0.20/0.49 thf(lYearFn_THFTYPE_IiiI,type,
% 0.20/0.49 lYearFn_THFTYPE_IiiI: $i > $i ).
% 0.20/0.49
% 0.20/0.49 thf(likes_THFTYPE_IiioI,type,
% 0.20/0.49 likes_THFTYPE_IiioI: $i > $i > $o ).
% 0.20/0.49
% 0.20/0.49 thf(n2009_THFTYPE_i,type,
% 0.20/0.49 n2009_THFTYPE_i: $i ).
% 0.20/0.49
% 0.20/0.49 %----The translated axioms
% 0.20/0.49 thf(ax,axiom,
% 0.20/0.49 ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
% 0.20/0.49 @ ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
% 0.20/0.49 & ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ) ) ).
% 0.20/0.49
% 0.20/0.49 %----The translated conjecture
% 0.20/0.49 thf(con,conjecture,
% 0.20/0.49 ? [Y: $i] : ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ Y @ lBill_THFTYPE_i ) ) ).
% 0.20/0.49
% 0.20/0.49 %------------------------------------------------------------------------------
% 0.20/0.49 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.GCfD20ZRjn/cvc5---1.0.5_10174.p...
% 0.20/0.49 (declare-sort $$unsorted 0)
% 0.20/0.49 (declare-sort tptp.num 0)
% 0.20/0.49 (declare-fun tptp.holdsDuring_THFTYPE_IiooI ($$unsorted Bool) Bool)
% 0.20/0.49 (declare-fun tptp.lBill_THFTYPE_i () $$unsorted)
% 0.20/0.49 (declare-fun tptp.lMary_THFTYPE_i () $$unsorted)
% 0.20/0.49 (declare-fun tptp.lSue_THFTYPE_i () $$unsorted)
% 0.20/0.49 (declare-fun tptp.lYearFn_THFTYPE_IiiI ($$unsorted) $$unsorted)
% 0.20/0.49 (declare-fun tptp.likes_THFTYPE_IiioI ($$unsorted $$unsorted) Bool)
% 0.20/0.49 (declare-fun tptp.n2009_THFTYPE_i () $$unsorted)
% 0.20/0.49 (assert (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (and (@ (@ tptp.likes_THFTYPE_IiioI tptp.lMary_THFTYPE_i) tptp.lBill_THFTYPE_i) (@ (@ tptp.likes_THFTYPE_IiioI tptp.lSue_THFTYPE_i) tptp.lBill_THFTYPE_i))))
% 0.20/0.52 (assert (not (exists ((Y $$unsorted)) (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (@ (@ tptp.likes_THFTYPE_IiioI Y) tptp.lBill_THFTYPE_i)))))
% 0.20/0.52 (set-info :filename cvc5---1.0.5_10174)
% 0.20/0.52 (check-sat-assuming ( true ))
% 0.20/0.52 ------- get file name : TPTP file name is CSR119^1
% 0.20/0.52 ------- cvc5-thf : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_10174.smt2...
% 0.20/0.52 --- Run --ho-elim --full-saturate-quant at 10...
% 0.20/0.52 % SZS status Theorem for CSR119^1
% 0.20/0.52 % SZS output start Proof for CSR119^1
% 0.20/0.52 (
% 0.20/0.52 (let ((_let_1 (not (exists ((Y $$unsorted)) (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (@ (@ tptp.likes_THFTYPE_IiioI Y) tptp.lBill_THFTYPE_i)))))) (let ((_let_2 (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (and (@ (@ tptp.likes_THFTYPE_IiioI tptp.lMary_THFTYPE_i) tptp.lBill_THFTYPE_i) (@ (@ tptp.likes_THFTYPE_IiioI tptp.lSue_THFTYPE_i) tptp.lBill_THFTYPE_i))))) (let ((_let_3 (ho_8 k_7 (ho_6 k_5 tptp.n2009_THFTYPE_i)))) (let ((_let_4 (ho_9 _let_3 BOOLEAN_TERM_VARIABLE_842))) (let ((_let_5 (ho_9 _let_3 BOOLEAN_TERM_VARIABLE_1175))) (let ((_let_6 (forall ((u |u_(-> $$unsorted Bool)|) (e Bool) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_4 v ii) (ite (= i ii) e (ho_4 u ii)))))))))) (let ((_let_7 (forall ((x |u_(-> $$unsorted Bool)|) (y |u_(-> $$unsorted Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_4 x z) (ho_4 y z)))) (= x y))))) (let ((_let_8 (forall ((u |u_(-> $$unsorted $$unsorted Bool)|) (e |u_(-> $$unsorted Bool)|) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted $$unsorted Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_3 v ii) (ite (= i ii) e (ho_3 u ii)))))))))) (let ((_let_9 (forall ((x |u_(-> $$unsorted $$unsorted Bool)|) (y |u_(-> $$unsorted $$unsorted Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_3 x z) (ho_3 y z)))) (= x y))))) (let ((_let_10 (forall ((u |u_(-> Bool Bool)|) (e Bool) (i Bool)) (not (forall ((v |u_(-> Bool Bool)|)) (not (forall ((ii Bool)) (= (ho_9 v ii) (ite (= i ii) e (ho_9 u ii)))))))))) (let ((_let_11 (forall ((x |u_(-> Bool Bool)|) (y |u_(-> Bool Bool)|)) (or (not (forall ((z Bool)) (= (ho_9 x z) (ho_9 y z)))) (= x y))))) (let ((_let_12 (forall ((u |u_(-> $$unsorted $$unsorted)|) (e $$unsorted) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted $$unsorted)|)) (not (forall ((ii $$unsorted)) (= (ho_6 v ii) (ite (= i ii) e (ho_6 u ii)))))))))) (let ((_let_13 (forall ((x |u_(-> $$unsorted $$unsorted)|) (y |u_(-> $$unsorted $$unsorted)|)) (or (not (forall ((z $$unsorted)) (= (ho_6 x z) (ho_6 y z)))) (= x y))))) (let ((_let_14 (forall ((u |u_(-> $$unsorted Bool Bool)|) (e |u_(-> Bool Bool)|) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted Bool Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_8 v ii) (ite (= i ii) e (ho_8 u ii)))))))))) (let ((_let_15 (forall ((x |u_(-> $$unsorted Bool Bool)|) (y |u_(-> $$unsorted Bool Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_8 x z) (ho_8 y z)))) (= x y))))) (let ((_let_16 (APPLY_UF ho_9))) (let ((_let_17 (ho_4 (ho_3 k_2 tptp.lSue_THFTYPE_i) tptp.lBill_THFTYPE_i))) (let ((_let_18 (ho_4 (ho_3 k_2 tptp.lMary_THFTYPE_i) tptp.lBill_THFTYPE_i))) (let ((_let_19 (and _let_18 _let_17))) (let ((_let_20 (MACRO_SR_PRED_INTRO :args ((= _let_19 BOOLEAN_TERM_VARIABLE_842))))) (let ((_let_21 (REFL :args (_let_3)))) (let ((_let_22 (ho_9 _let_3 _let_19))) (let ((_let_23 (AND_ELIM (EQ_RESOLVE (MACRO_SR_PRED_TRANSFORM (AND_INTRO (EQ_RESOLVE (ASSUME :args (_let_2)) (PREPROCESS :args ((= _let_2 _let_22)))) (PREPROCESS :args ((and _let_15 _let_14 _let_13 _let_12 _let_11 _let_10 _let_9 _let_8 _let_7 _let_6)))) :args ((and _let_22 _let_15 _let_14 _let_13 _let_12 _let_11 _let_10 _let_9 _let_8 _let_7 _let_6))) (CONG (CONG _let_21 _let_20 :args _let_16) (REFL :args (_let_15)) (REFL :args (_let_14)) (REFL :args (_let_13)) (REFL :args (_let_12)) (REFL :args (_let_11)) (REFL :args (_let_10)) (REFL :args (_let_9)) (REFL :args (_let_8)) (REFL :args (_let_7)) (REFL :args (_let_6)) :args (and))) :args (0)))) (let ((_let_24 (ho_9 _let_3 BOOLEAN_TERM_VARIABLE_1100))) (let ((_let_25 (not BOOLEAN_TERM_VARIABLE_842))) (let ((_let_26 (forall ((Y $$unsorted)) (not (ho_9 (ho_8 k_7 (ho_6 k_5 tptp.n2009_THFTYPE_i)) (ho_4 (ho_3 k_2 Y) tptp.lBill_THFTYPE_i)))))) (let ((_let_27 (not _let_24))) (let ((_let_28 (EQ_RESOLVE (ASSUME :args (_let_1)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (forall ((Y $$unsorted)) (not (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (@ (@ tptp.likes_THFTYPE_IiioI Y) tptp.lBill_THFTYPE_i)))) _let_26))))))) (let ((_let_29 (=>))) (let ((_let_30 (not))) (let ((_let_31 (MACRO_SR_PRED_INTRO :args ((= _let_17 BOOLEAN_TERM_VARIABLE_1100))))) (let ((_let_32 (_let_26))) (let ((_let_33 (REFL :args _let_32))) (let ((_let_34 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (INSTANTIATE _let_28 :args (tptp.lSue_THFTYPE_i QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_32) (CONG _let_33 (CONG (CONG _let_21 _let_31 :args _let_16) :args _let_30) :args _let_29))) _let_28 :args (_let_27 false _let_26)))) (let ((_let_35 (not _let_19))) (let ((_let_36 (not _let_4))) (let ((_let_37 (or))) (let ((_let_38 (not BOOLEAN_TERM_VARIABLE_1100))) (let ((_let_39 (MACRO_SR_PRED_INTRO :args ((= (not _let_27) _let_24))))) (let ((_let_40 (MACRO_SR_PRED_INTRO :args ((= (not _let_25) BOOLEAN_TERM_VARIABLE_842))))) (let ((_let_41 (REFL :args (_let_36)))) (let ((_let_42 (ASSUME :args (_let_27)))) (let ((_let_43 (FALSE_INTRO _let_42))) (let ((_let_44 (_let_38))) (let ((_let_45 (ASSUME :args _let_44))) (let ((_let_46 (_let_25))) (let ((_let_47 (ASSUME :args _let_46))) (let ((_let_48 (FALSE_INTRO _let_47))) (let ((_let_49 (ASSUME :args (_let_4)))) (let ((_let_50 (TRUE_INTRO _let_49))) (let ((_let_51 (SYMM _let_50))) (let ((_let_52 (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_42 _let_45 _let_47 _let_49) :args (_let_4 _let_25 _let_27 _let_38)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS _let_51 (CONG _let_21 (TRANS _let_48 (SYMM (FALSE_INTRO _let_45))) :args _let_16) _let_43)) :args (_let_27 _let_38 _let_25 _let_4)) :args ((not (and _let_4 _let_25 _let_27 _let_38)) SB_LITERAL))) (CONG _let_41 _let_40 _let_39 (MACRO_SR_PRED_INTRO :args ((= (not _let_38) BOOLEAN_TERM_VARIABLE_1100))) :args _let_37)) :args ((or BOOLEAN_TERM_VARIABLE_842 _let_36 BOOLEAN_TERM_VARIABLE_1100 _let_24))) _let_34 _let_23 (EQUIV_ELIM2 _let_20) (EQUIV_ELIM2 _let_31) (REORDERING (CNF_AND_POS :args (_let_19 1)) :args ((or _let_17 _let_35))) :args (_let_17 true _let_24 false _let_4 true BOOLEAN_TERM_VARIABLE_842 true BOOLEAN_TERM_VARIABLE_1100 true _let_19)))) (let ((_let_53 (EQUIV_ELIM1 _let_31))) (let ((_let_54 (ASSUME :args (BOOLEAN_TERM_VARIABLE_1100)))) (let ((_let_55 (ASSUME :args (BOOLEAN_TERM_VARIABLE_842)))) (let ((_let_56 (REORDERING (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_42 _let_54 _let_55 _let_49) :args (BOOLEAN_TERM_VARIABLE_842 _let_4 BOOLEAN_TERM_VARIABLE_1100 _let_27)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS _let_51 (CONG _let_21 (TRANS (TRUE_INTRO _let_55) (SYMM (TRUE_INTRO _let_54))) :args _let_16) _let_43)) :args (_let_27 BOOLEAN_TERM_VARIABLE_1100 BOOLEAN_TERM_VARIABLE_842 _let_4)) :args ((not (and BOOLEAN_TERM_VARIABLE_842 _let_4 BOOLEAN_TERM_VARIABLE_1100 _let_27)) SB_LITERAL))) (CONG (REFL :args _let_46) _let_41 (REFL :args _let_44) _let_39 :args _let_37)) :args ((or _let_36 _let_25 _let_24 _let_38))))) (let ((_let_57 (not _let_5))) (let ((_let_58 (MACRO_SR_PRED_INTRO :args ((= _let_18 BOOLEAN_TERM_VARIABLE_1175))))) (let ((_let_59 (not BOOLEAN_TERM_VARIABLE_1175))) (let ((_let_60 (not _let_18))) (let ((_let_61 (ASSUME :args (_let_59)))) (let ((_let_62 (ASSUME :args (_let_57)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_49 _let_47 _let_61 _let_62) :args (_let_4 _let_25 _let_57 _let_59)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS (SYMM (FALSE_INTRO _let_62)) (CONG _let_21 (TRANS (FALSE_INTRO _let_61) (SYMM _let_48)) :args _let_16) _let_50)) :args (_let_4 _let_25 _let_59 _let_57)) :args ((not (and _let_4 _let_25 _let_57 _let_59)) SB_LITERAL))) (CONG _let_41 _let_40 (MACRO_SR_PRED_INTRO :args ((= (not _let_57) _let_5))) (MACRO_SR_PRED_INTRO :args ((= (not _let_59) BOOLEAN_TERM_VARIABLE_1175))) :args _let_37)) :args ((or BOOLEAN_TERM_VARIABLE_842 _let_36 BOOLEAN_TERM_VARIABLE_1175 _let_5))) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM2 _let_58) (MACRO_RESOLUTION_TRUST (MACRO_RESOLUTION_TRUST _let_56 _let_34 _let_23 (REORDERING (EQUIV_ELIM1 _let_20) :args ((or BOOLEAN_TERM_VARIABLE_842 _let_35))) _let_53 (CNF_AND_NEG :args (_let_19)) :args ((or _let_60 (not _let_17)) true _let_24 false _let_4 false BOOLEAN_TERM_VARIABLE_842 false BOOLEAN_TERM_VARIABLE_1100 false _let_19)) _let_52 :args (_let_60 false _let_17)) :args (_let_59 true _let_18)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (INSTANTIATE _let_28 :args (tptp.lMary_THFTYPE_i QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_32) (CONG _let_33 (CONG (CONG _let_21 _let_58 :args _let_16) :args _let_30) :args _let_29))) _let_28 :args (_let_57 false _let_26)) (MACRO_RESOLUTION_TRUST _let_56 (MACRO_RESOLUTION_TRUST _let_53 _let_52 :args (BOOLEAN_TERM_VARIABLE_1100 false _let_17)) _let_34 _let_23 :args (_let_25 false BOOLEAN_TERM_VARIABLE_1100 true _let_24 false _let_4)) _let_23 :args (false true BOOLEAN_TERM_VARIABLE_1175 true _let_5 true BOOLEAN_TERM_VARIABLE_842 false _let_4)) :args (_let_2 _let_1 true)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))
% 0.20/0.52 )
% 0.20/0.52 % SZS output end Proof for CSR119^1
% 0.20/0.52 % cvc5---1.0.5 exiting
% 0.20/0.52 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------